Computing m DFTs over GF(q) with one DFT over GF(q/sup m/)

Computing m DFT's over GF(q) with one DFT over GF(qm)

Canonical (m,n)−ary hypermodules over Krasner (m,n)−ary hyperrings

The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...

An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m

The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, k-error linear complexity, the minimum error and the k-error linear complexity profile, the notion of m-tight error linear complexity is presented. An efficient algorithm for computing m-tight error linear complexity is derived from the algo...

Bijections over {0, · · · , M − 1} Derived from Polynomials modulo M

This paper mainly studies problems about so called “bijective polynomials modulo m”, integer polynomials that can generate bijections over {0, · · · , m − 1}. This research is from a real application of number theory in cryptography. It is expected that the study on bijective polynomials modulo m will also benefit general congruence theory. Some problems have not been successfully solved in thi...

M m m Queue with Balking, Reneging and Additional Servers

In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...